Hierarchical Attentive Transaction Embedding With Intra- and Inter-Transaction Dependencies for Next-Item Recommendation
نویسندگان
چکیده
A transaction-based recommender system (TBRS) aims to predict the next item by modeling dependencies in transactional data. Generally, two kinds of considered are intra-transaction dependence and inter-transaction dependence. Most existing TBRSs recommend only within current transaction while ignoring with recent transactions that may also affect item. However, as not all relevant items, ones should be identified prioritized. In this article, we propose a novel hierarchical attentive embedding (HATE) model tackle these issues. Specifically, two-level attention mechanism integrates both build an context representation incorporates intra- dependencies. With learned representation, HATE then recommends Experimental evaluations on real-world datasets show significantly outperforms state-of-the-art methods terms recommendation accuracy.
منابع مشابه
A hybrid approach for database intrusion detection at transaction and inter-transaction levels
Nowadays, information plays an important role in organizations. Sensitive information is often stored in databases. Traditional mechanisms such as encryption, access control, and authentication cannot provide a high level of confidence. Therefore, the existence of Intrusion Detection Systems in databases is necessary. In this paper, we propose an intrusion detection system for detecting attacks...
متن کاملInter- and Intra-Transaction Parallelism in Database Systems
This paper presents an approach to improving database performance by combining parallelism of multiple independent transactions and parallelism of multiple sub-transactions within a transaction. An experimental prototype has been built that supports this combination of inter-and intra-transaction parallelism based on the framework of multi-level transaction management. A performance study for a...
متن کاملTransitive Dependencies in Transaction Closures
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. termination or execution dependencies which are constraints on the occurrence of significant transaction events. In this paper, we analyze a set of (orthogonal) transaction dependencies. Here, we do not follow traditional...
متن کاملExecution Dependencies in Transaction Closures
Activities of advanced applications can be modeled by interrelated transactions. These relations can be described by diierent kinds of transaction dependencies. The notion of transaction closure is a generalization of nested transactions providing means to describe complex activities such as transactional workkows. In this paper, our main focus lies on execution dependencies for describing cert...
متن کاملConstrained Preference Embedding for Item Recommendation
To learn users’ preference, their feedback information is commonly modeled as scalars and integrated into matrix factorization (MF) based algorithms. Based on MF techniques, the preference degree is computed by the product of user and item vectors, which is also represented by scalars. On the contrary, in this paper, we express users’ feedback as constrained vectors, and call the idea constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Intelligent Systems
سال: 2021
ISSN: ['1941-1294', '1541-1672']
DOI: https://doi.org/10.1109/mis.2020.2997362